Integer Decomposition Property of Free Sums of Convex Polytopes

نویسندگان

  • TAKAYUKI HIBI
  • AKIHIRO HIGASHITANI
چکیده

Let P ⊂ R and Q ⊂ R be integral convex polytopes of dimension d and e which contain the origin of R and R, respectively. In the present paper, under some assumptions, the necessary and sufficient condition for the free sum of P and Q to possess the integer decomposition property will be presented. Introduction A convex polytope is called integral if any of its vertices has integer coordinates. Let P ⊂ R and Q ⊂ R be convex polytopes and suppose that 0d ∈ P and 0e ∈ Q, where 0d ∈ R d denotes the origin of R and 0e ∈ R e denotes that of R. We introduce the canonical injections μ : R → R by setting μ(α) = (α, 0e) ∈ R d+e with α ∈ R and ν : R → R by setting ν(β) = (0d, β) ∈ R d+e with β ∈ R. In particular, μ(0d) = ν(0e) = 0d+e, where 0d+e denotes the origin of R . Then μ(P) and ν(Q) are convex polytopes of R with μ(P) ∩ ν(Q) = 0d+e ∈ R . The free sum of P and Q is the convex hull of the set μ(P) ∪ ν(Q) in R. It is written as P ⊕Q. One has dim(P ⊕Q) = dimP + dimQ. For a convex polytope P ⊂ R and for each integer n ≥ 1, we write nP for the convex polytope {nα : α ∈ P} ⊂ R. We say that an integral convex polytope P ⊂ R possesses the integer decomposition property if, for each n ≥ 1 and for each γ ∈ nP ∩ Z, there exist γ, . . . , γ belonging to P ∩ Z such that γ = γ + . . .+ γ. Let P ⊂ R and Q ⊂ R be convex polytopes containing the origin (of R or R). It is then easy to see that if the free sum of P and Q possesses the integer decomposition property, then each of P and Q possesses the integer decomposition property. On the other hand, the converse is not true in general. (See Example 0.3.) The purpose of the present paper is to show the following Theorem 0.1. Let P ⊂ R and Q ⊂ R be integral convex polytopes of dimension d and dimension e containing 0d and 0e, respectively. Suppose that P and Q satisfy Z(P ∩ Z) = Z, Z(Q ∩ Z) = Z and (P ⊕Q) ∩ Z = μ(P ∩ Z) ∪ ν(Q ∩ Z). (1) 2010 Mathematics Subject Classification: 52B20.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Minkowski Sum of Polytopes and Its Normality

In this paper, we consider the normality or the integer decomposition property (IDP, for short) for Minkowski sums of integral convex polytopes. We discuss some properties on the toric rings associated with Minkowski sums of integral convex polytopes. We also study Minkowski sums of edge polytopes and give a sufficient condition for Minkowski sums of edge polytopes to have IDP.

متن کامل

Integer Decomposition Property of Dilated Polytopes

An integral convex polytope P ⊂ RN possesses the integer decomposition property if, for any integer k > 0 and for any α ∈ kP∩ZN , there exist α1, . . . , αk ∈ P∩ZN such that α = α1 + · · · + αk. A fundamental question is to determine the integers k > 0 for which the dilated polytope kP possesses the integer decomposition property. In the present paper, combinatorial invariants related to the in...

متن کامل

CAYLEY DECOMPOSITIONS OF LATTICE POLYTOPES AND UPPER BOUNDS FOR h-POLYNOMIALS

We give an effective upper bound on the h-polynomial of a lattice polytope in terms of its degree and leading coefficient, confirming a conjecture of Batyrev. We deduce this bound as a consequence of a strong Cayley decomposition theorem which says, roughly speaking, that any lattice polytope with a large multiple that has no interior lattice points has a nontrivial decomposition as a Cayley su...

متن کامل

Asymptotic Estimates for the Number of Contingency Tables, Integer Flows, and Volumes of Transportation Polytopes

We prove an asymptotic estimate for the number of m×n non-negative integer matrices (contingency tables) with prescribed row and column sums and, more generally, for the number of integer feasible flows in a network. Similarly, we estimate the volume of the polytope of m × n non-negative real matrices with prescribed row and column sums. Our estimates are solutions of convex optimization proble...

متن کامل

Gelfand-Tsetlin polytopes and the integer decomposition property

Let P be the Gelfand–Tsetlin polytope defined by the skew shape λ/μ and weight w. In the case corresponding to a standard Young tableau, we completely characterize for which shapes λ/μ the polytope P is integral. Furthermore, we show that P is a compressed polytopewhenever it is integral and corresponds to a standard Young tableau.We conjecture that a similar property holds for arbitraryw, name...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2014